The domino inequalities: facets for the symmetric traveling salesman polytope
نویسندگان
چکیده
منابع مشابه
New facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on an incomplete graph with 2n vertices, no method was available until recently for using this correspondence to derive facets of the symmetric traveling salesman polytope from facets of the asymmetric one. In this paper w...
متن کاملOn the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra
The Symmetric Traveling Salesman Polytope Sn for a fixed number n of cities is a face of the corresponding Graphical Traveling Salesman Polyhedron Pn. This has been used to study facets of Sn using Pn as a tool. In this paper, we study the operation of “rotating” (or “lifting”) valid inequalities for Sn to obtain a valid inequalities for Pn. As an application, we describe a surprising relations...
متن کاملThe symmetric quadratic traveling salesman problem
In the quadratic traveling salesman problem a cost is associated with any three nodes traversed in succession. This structure arises, e. g., if the succession of two edges represents energetic conformations, a change of direction or a possible change of transportation means. In the symmetric case, costs do not depend on the direction of traversal. We study the polyhedral structure of a lineariz...
متن کاملThe Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
The path, the wheelbarrow, and the bicycle inequalities have been shown by Cornuéjols, Fonlupt, and Naddef to be facetdefining for the graphical relaxation of STSP n , the polytope of the symmetric traveling salesman problem on an n-node complete graph. We show that these inequalities, and some generalizations of them, define facets also for STSP n . In conclusion, we characterize a large famil...
متن کاملFacet Generating Techniques
Given a polyhedron P which is of interest, a major goal of polyhedral combinatorics is to find classes of essential, i.e. facet inducing inequalities which describe P . In general this is a difficult task. We consider the case in which we have knowledge of facets for a face F of P , and present some general theory and methods for exploiting the close relationship between such polyhedra in order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 98 شماره
صفحات -
تاریخ انتشار 2003